/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#include <vector>

#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;

int ha[maxn], vis[maxn];
vector<int> ve[maxn];
int n, k;
int a[maxn];
void dfs(int x, int now, int p, int val)
{
    if (val == k)
    {
        ve[x].push_back(now);
        return;
    }
    if (p >= 14)
        return;
    dfs(x, now ^ (1 << p), p + 1, val + 1);
    dfs(x, now, p + 1, val);
}
int base = (1 << 14) - 1;
void dfs2(int x, int now, int p, int val)
{
    if (val == 14 - k)
    {
        ve[x].push_back(now ^ base);
        return;
    }
    if (p >= 14)
        return;
    dfs2(x, now ^ (1 << p), p + 1, val + 1);
    dfs2(x, now, p + 1, val);
}
int main()
{
    IOS;
    cin >> n >> k;
    memset(vis, 0, sizeof(vis));
    memset(ha, 0, sizeof(ha));
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (!vis[a[i]])
        {
            if (k <= 7)
                dfs(a[i], a[i], 0, 0);
            else
            {
                dfs2(a[i], a[i], 0, 0);
            }

            vis[a[i]] = 1;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        int len = ve[a[i]].size();
        for (int j = 0; j < len; j++)
        {
            int t = ve[a[i]][j];
            ans += ha[t];
        }
        ha[a[i]]++;
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
